The optimal on-line parallel machine scheduling
نویسندگان
چکیده
منابع مشابه
An Asymptotically Optimal On-Line Algorithm for Parallel Machine Scheduling
| Jobs arriving over time must be nonpreemptively processed on one of m parallel machines, each of which running at its own speed, so as to minimize a weighted sum of the job completion times. In this on-line environment, the processing requirement and weight of a job are not known before the job arrives. The Weighted Shortest Processing Requirement (WSPR) on-line heuristic is a simple extensio...
متن کاملOptimal On-Line Algorithms for Single-Machine Scheduling
We consider single-machine on-line scheduling problems where jobs arrive over time. A set of independent jobs has to be scheduled on the machine, where preemption is not allowed and the number of jobs is unknown in advance. Each job becomes available at its release date, which is not known in advance, and its characteristics, e.g., processing requirement, become known at its arrival. We deal wi...
متن کاملParallel Machine Scheduling Problem
A new constructive heuristic for the scheduling problem of n independent jobs on m identical parallel machines with minimum makespan objective is described. The proposed algorithm, which is an n logn algorithm as the LPT algorithm of Graham, iteratively combines partial solutions that are obtained by partitioning the set of jobs in suitable families of subsets. The algorithm was tested using di...
متن کاملParallel Machine Batch Scheduling
The problem of scheduling G groups of jobs on m unrelated parallel machines is considered. Each group consists of several identical jobs. Implicit in a schedule is a partition of a group into batches; all jobs of a batch are processed jointly. It is possible for diierent batches of the same group to be processed concurrently on diierent machines. However, at any time, a batch can be processed o...
متن کاملOn-line machine scheduling with batch setups
We study a class of scheduling problems with batch setups for the online-list and online-time paradigms. Jobs are to be scheduled in batches for processing. All jobs in a batch start and complete together, and a constant setup is prior to each batch. The objective is to minimize the total completion time of all jobs. We primarily consider the special cases of these problems with identical proce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2000
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(00)00070-5